A Greedy Method for Constructing Minimal Multiconlitron
نویسندگان
چکیده
منابع مشابه
A Supervised Method for Constructing Sentiment Lexicon in Persian Language
Due to the increasing growth of digital content on the internet and social media, sentiment analysis problem is one of the emerging fields. This problem deals with information extraction and knowledge discovery from textual data using natural language processing has attracted the attention of many researchers. Construction of sentiment lexicon as a valuable language resource is a one of the imp...
متن کاملConstructing interference-minimal networks
We consider the problem of producing interferenceminimal graphs with additional properties such as connectivity, bounded stretch factor or bounded link diameter. We compute exact interference-minimal graphs and estimated interference-minimal graphs. The latter can be computed faster.
متن کاملA method for constructing generalized
Sugiura, H. and T. Torii, A method for constructing generalized Runge-Kutta methods, Journal of Computational and Applied Mathematics 38 (1991) 399-410. In the implementation of an implicit Runge-Kutta formula, we need to solve systems of nonlinear equations. In this paper, we analyze the Newton iteration process and a modified Newton iteration process for solving these equations. Then we propo...
متن کاملOn Constructing Minimal Formulae
Given a Boolean propositional formula, φ(Xn) over the basis Ω = {∧,∨,¬} we consider the following decision problem: is there a subset of literals, S, for which φ(Xn) ≡ ∧ y∈S y or φ(Xn) ≡ ∨ y∈S y? We prove that the “obvious” Σ p 2 upper bound is sub-optimal and that the problem is decidable in PNP || the class of languages decidable by polynomial time methods allowed to make non-adaptive queries...
متن کاملA Trust Region Method for Constructing Triangle-mesh Approximations of Parametric Minimal Surfaces
Given a function f0 defined on the unit square Ω with values in R, we construct a piecewise linear function f on a triangulation of Ω such that f agrees with f0 on the boundary nodes, and the image of f has minimal surface area. The problem is formulated as that of minimizing a discretization of a least squares functional whose critical points are uniformly parameterized minimal surfaces. The n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2019
ISSN: 2169-3536
DOI: 10.1109/access.2019.2957516